Matching and multidimensional matching in chordal and strongly chordal graphs
نویسندگان
چکیده
منابع مشابه
Maximum Vertex-weighted Matching in Strongly Chordal Graphs
Given a graph G = (V; E) and a real weight for each vertex of G, the vertex-weight of a matching is deened to be the sum of the weights of the vertices covered by the matching. In this paper we present a linear time algorithm for nding a maximum vertex-weighted matching in a strongly chordal graph, given a strong elimination ordering. The algorithm can be specialized to nd a maximum cardinality...
متن کاملStrongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V,E1) and G2 = (V,E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \E1 such that G = (V,E1 ∪ {e1, . . . , ei}) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakon...
متن کاملStrongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs
In this paper those graphs are studied for which a so-called strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way. We consider two characteristic elimination orderings for strongly orderable graphs, one on the vertex set and the second on the edge set, and...
متن کاملGraph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees with unbounded k. On the other side, the relative complexity of the GI probl...
متن کاملA characterization of strongly chordal graphs
Elias Dahlhaus Paul D. Manuel y Mirka Miller y Abstract In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the cycle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00006-7